Discrete Time Single Server Queueing Model with a Multimodal Packet Size Distribution
نویسندگان
چکیده
The importance of IP network will further increase and it will serve as a platform for more and more services, requiring different types and degrees of service quality. In this paper, we investigate the queueing behaviour found in input buffers in IP switch or router. To analyze these types of behaviour, we study the discrete-time version of the “classical” queue model M/M/1/k called Geo/MM/1/k and P/MM/1/k. We use a geometric (Geo) and Pareto (P) distributed inter-arrival time and a discrete multimodal packet length distribution (MM), defined on a range between a minimum and maximum value. In this model, the time unit is reduced from a packet service time to the time to transmit a byte. We develop balance equations for the state of the system, from which we derive packet delay and loss results. The finding that Geometric and Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to evaluate steady-state performance measures of Geo/MM/1/k queue. We propose a real time trace simulation model for estimating the steady-state probability showing the loss probability and delay of the P/MM/1/k queue. This model can be used to study the long-tailed queueing systems.
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملQueueing Analysis of a Discrete-Time Multiserver Buffer System with Geometric Service Times
In this paper, a discrete-time multiserver queueing system with infinite buffer size and general independent arrivals is considered. The service times of a packet served by one of the servers are assumed to be independent and identically distributed according to a geometric distribution. Each packet gets service from only one server. In the paper, the behavior of the queueing system is studied ...
متن کاملSynopsis of the Ph.D. Thesis Title: Modeling and Analysis of Queueing systems with Discrete Autoregressive Arrivals and Counting Processes Research Scholar: BINDU ABRAHAM Research Guide: Dr.K.K.Jose
This thesis is mainly intended to study various discrete time multiserver queueing systems governed by a discrete autoregressive process of order 1 with a particular marginal distribution. In this integer valued time queue, the time is divided into slots of equal size and one slot is needed to serve a packet by a server. We assume that packet arrivals occur at the beginning of the slots and dep...
متن کاملDiscrete-time multiserver queues with geometric service times
In this paper, a discrete-time multiserver queueing system with in4nite bu5er size and general independent arrivals is considered. The service times of packets are assumed to be independent and identically distributed according to a geometric distribution. Each packet gets service from only one server. In the paper, the behavior of the queueing system is studied analytically by means of a gener...
متن کامل